Fast Cube Tests for LIA Constraint Solving
نویسندگان
چکیده
We present two tests that solve linear integer arithmetic constraints. These tests are sound and efficiently find solutions for a large number of problems. While many complete methods search along the problem surface for a solution, these tests use cubes to explore the interior of the problems. The tests are especially efficient for constraints with a large number of integer solutions, e.g., those with infinite lattice width. Inside the SMT-LIB benchmarks, we have found almost one thousand problem instances with infinite lattice width, and we have shown the advantage of our cube tests on these instances by comparing our implementation of the cube test with several state-of-the-art SMT solvers. Our implementation is not only several orders of magnitudes faster, but it also solves all instances, which most SMT solvers do not. Finally, we discovered an additional application for our cube tests: the extraction of equalities implied by a system of linear arithmetic inequalities. This extraction is useful both as a preprocessing step for linear integer constraint solving as well as for the combination of theories by the Nelson-Oppen
منابع مشابه
New techniques for linear arithmetic: cubes and equalities
We present several new techniques for linear arithmetic constraint solving. They are all based on the linear cube transformation, a method presented here, which allows us to efficiently determine whether a system of linear arithmetic constraints contains a hypercube of a given edge length. Our first findings based on this transformation are two sound tests that find integer solutions for linear...
متن کاملSolving Rubik's Cube Using SAT Solvers
Rubik’s Cube is an easily-understood puzzle, which is originally called the “magic cube”. It is a well-known planning problem, which has been studied for a long time. Yet many simple properties remain unknown. This paper studies whether modern SAT solvers are applicable to this puzzle. To our best knowledge, we are the first to translate Rubik’s Cube to a SAT problem. To reduce the number of va...
متن کاملConcurrent Cube-and-Conquer - (Poster Presentation)
Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) [5]. This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers [3] often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found. The ...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملThe Permutation Group of the Rubik’s Cube
The Rubik’s Cube (Figure 1a) is a widely known cultural icon. It is a mechanical puzzle which can be visualized as a three-dimensional 3x3x3 array of 27 unique cubies, where the visible outer faces of the cubies are covered with stickers colored according to their orientation. From this solved state, any outer “slice” of 9 cubies may be rotated to permute the cubies –Figure 1b shows the effect ...
متن کامل